#include <iostream>

using namespace std;

typedef long long LL;

const int N = 501, M = 197;
int f[N][M];
int n;

void add(int C[], int B[])
{
	for(int i = 0; i <= M - 1; i++)
	{
		C[i] += B[i];
		C[i + 1] += C[i] / 10;
		C[i] %= 10;
	}
}

int main()
{
	cin >> n;
	f[0][0] = 1;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= i; j++)
		{
			add(f[j], f[j - 1]);
		}
	}
	int pos = M - 1;
	while(f[n][pos] == 0) pos--;
	while(pos >= 0) cout << f[n][pos--];
	return 0;
}
